Hidden Real Modulus RSA Cryptosystem

نویسندگان

چکیده

Cryptographic techniques in cyber security can be categorized into symmetric and asymmetric. Among asymmetric cryptographic techniques, the RSA algorithm is more popular considered as secured. Since, uses common modulus both encryption decryption, this openly available for public which makes it exposed attack. Its based on assumption of large integer factorization problem, but could leave open to different cryptanalysis attacks: low private exponent attack, Shor’s polynomial-time quantum algorithm, inverse Fourier transform phase estimation. To address these shortcomings, paper proposes a public-key called Hidden Real Modulus (HRM-RSA) hides real by masking it. The mask pseudo random number derived from modulus. Then, introduced key component; result, kept hidden unlike case RSA. Encryption done using decryption process For performance analysis Net bean IDE 8.2 used, proposed compared with state-of-the-art algorithms: RSA, ESRKGS, MRSA strength, time complexity, generation time, speed, speed. shows that HRM-RSA less complex highly secured than existing algorithms. It improves 311%, 42%; 0.7%, 139%, 735%; 3%, 138%, 799%, respectively.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Attack on RSA Cryptosystem

The RSA cryptosystem is most widely used cryptosystem it may be used to provide both secrecy and digital signatures and its security is based on the intractability of the integer factorization. The security of RSA algorithm depends on the ability of the hacker to factorize numbers. New, faster and better methods for factoring numbers are constantly being devised. The Trent best for long numbers...

متن کامل

Improvement in RSA Cryptosystem

Boneh and Shacham gave a nice survey on four variants (Batch RSA, MultiPrime RSA, MultiPower RSA, Rebalanced RSA). Rebalanced RSA and MultiPower RSA were then combined to increase the decryption/signature generation performance. This combination theoretically improves the decryption/signature generation time about 14 times than RSA with CRT and about 56 times than the standard RSA with key size...

متن کامل

The RSA Cryptosystem

This paper explores the history and mathematics be­ hind the RSA cryptosystem, including the idea of public key cryp­ tosystems and number theory. It outlines the applications of RSA including secure information transfers and electronic signatures. It also analyzes why RSA is a secure way of transmitting information and the ways that it has been defeated in the past. In particular, we focus on ...

متن کامل

Modified Montgomery for RSA Cryptosystem

Encryption and decryption in RSA are done by modular exponentiation which is achieved by repeated modular multiplication. Hence efficiency of modular multiplication directly determines the efficiency of RSA cryptosystem. This paper designs a Modified Montgomery Modular Multiplication in which addition of operands is computed by 4:2 compressor. The basic logic operations in addition are partitio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computing

سال: 2023

ISSN: ['2312-5381', '1727-6209']

DOI: https://doi.org/10.47839/ijc.22.2.3094